Using Regret Estimation to Solve Games Compactly

Source URL: poker.cs.ualberta.ca

• Game theory
• Academia
• Abstraction
• Mathematics
• Solved game
• Mathematical game
• Computational complexity theory
• Mathematical problem
• Nash equilibrium
• Regression analysis
• Extensive-form game

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

Source URL: rakaposhi.eas.asu.edu

• Search algorithms
• Heuristics
• Mathematics
• Cognition
• Admissible heuristic
• Graphplan
• Computational complexity theory
• Algorithm
• Hyper-heuristic
• Book:Graph Theory

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

Why walking the dog takes time: Fr´echet distance has no strongly subquadratic algorithms unless SETH fails Karl Bringmann∗ April 10, 2014 Abstract

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Exponential time hypothesis
• Time complexity
• NC
• Gadget

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations Matthias Troyer,1 Uwe-Jens Wiese2 arXiv:cond-mat/0408370v1 [cond-mat.stat-mech] 16 Aug 2004

Source URL: www.wiese.itp.unibe.ch

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics

Source URL: www.maths.lse.ac.uk

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Matching
• P
• Time complexity
• Decision problem
• P versus NP problem
• 3-dimensional matching

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Source URL: www.cas.mcmaster.ca

• Computational complexity theory
• Game theory
• Theory of computation
• Computational problems
• Cooperative game theory
• Core
• NC
• Optimization problem

THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES Alexander Barvinok and Ellen Veomett October 2006 Abstract. We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X f

Source URL: www.math.lsa.umich.edu

• Geometry
• Mathematics
• Space
• Polytopes
• Operations research
• Convex analysis
• Real algebraic geometry
• Linear algebra
• Simplex
• Linear programming
• Mathematical optimization
• Convex hull

Omer Reingold, August 2015 My research is in the Foundations of Computer Science. My core areas are Computational Complexity and Foundations of Cryptography with emphasis on Randomness, Derandomization and Explicit Combi

Source URL: omereingold.files.wordpress.com